Synchrony vs Causality in the Asynchronous Pi-Calculus
نویسندگان
چکیده
منابع مشابه
Synchrony vs Causality in the Asynchronous Pi-Calculus
We study the relation between process calculi that differ in their either synchronous or asynchronous interaction mechanism. Concretely, we are interested in the conditions under which synchronous interaction can be implemented using just asynchronous interactions in the π-calculus. We assume a number of minimal conditions referring to the work of Gorla: a “good” encoding must be compositional ...
متن کاملSynchrony vs. Causality in Asynchronous Petri Nets
Given a synchronous system, we study the question whether the behaviour of that system can be exhibited by a (non-trivially) distributed and hence asynchronous implementation. In this paper we show, by counterexample, that synchronous systems cannot in general be implemented in an asynchronous fashion without either introducing an infinite implementation or changing the causal structure of the ...
متن کاملThe Probabilistic Asynchronous Pi - Calculus
In this dissertation, we consider a distributed implementation of the π-calculus, more precisely, the version of the π-calculus with mixed choice. To this end, we present the probabilistic asynchronous π-calculus, which is an extension of the asynchronous πcalculus enhanced with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made ...
متن کاملProbabilistic Asynchronous pi-Calculus
We propose an extension of the asynchronous π-calculus with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made internally by the process, and nondeterministic choice, made externally by an adversary scheduler. This distinction will allow us to reason about the probabilistic correctness of algorithms under certain schedulers. We s...
متن کاملOn the Asynchronous Nature of the Asynchronous pi-Calculus
We address the question of what kind of asynchronous communication is exactly modeled by the asynchronous π-calculus (πa). To this purpose we define a calculus πB where channels are represented explicitly as special buffer processes. The base language for πB is the (synchronous) π-calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with πa. It tu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.64.7